منابع مشابه
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland procedure (DLL) for propositional satisfiability (SAT). In this paper we show how it is possible to e...
متن کاملFPGA Logic Synthesis Using Quantified Boolean Satisfiability
This paper describes a novel Field Programmable Gate Array (FPGA) logic synthesis technique which determines if a logic function can be implemented in a given programmable circuit and describes how this problem can be formalized and solved using Quantified Boolean Satisfiability. This technique is general enough to be applied to any type of logic function and programmable circuit; thus, it has ...
متن کاملBoolean Programs and Quantified Propositional Proof Systems
Definition: A proof system is a feasible (i.e. easily computable) map f : {0,1}∗ onto −→ {tautologies} Where {tautologies} is just the set of propositional tautologies, and if f(x) = A then x is the proof of the propositional tautology A. A proof system is polynomially bounded if there exists a polynomial p such that for every A ∈ {tautologies}, there exists an x such that |x| ≤ p(|A|), i.e. ev...
متن کاملProof internalization in generalized Frege systems for classical logic
We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.
متن کاملEpistemic Quantified Boolean Logic: Expressiveness and Completeness Results
We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents’ knowledge in multi-agent contexts, such as “agent a knows as much as agent b”. We analyse the expressiveness of EQBL through a translation into monadic second-order logic, and provide complete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2020
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3381881